Decomposing Jacobians of Curves with Extra Automorphisms
نویسنده
چکیده
Given a fixed genus g, we would like to know the largest possible integer t such that t copies of one elliptic curve E appear in the decomposition of the Jacobian variety JX for some curve X of genus g. In this paper we find nontrivial lower bounds for t for genus up to 10. For genus 3 through 6 we demonstrate curves X such that JX∼E .
منابع مشابه
Decomposing Jacobians of Hyperelliptic Curves
Many interesting questions can be asked about the decomposition of Jacobians of curves. For instance, we may want to know which curves have completely decomposable Jacobians (Jacobians which are the product of g elliptic curves) [4]. We may ask about number theoretic properties of the elliptic curves that show up in the decomposition of Jacobians of curves [2]. We would also like to know how ma...
متن کاملComputing in Picard groups of projective curves over finite fields
We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that various desirable operations can be performed efficiently in this setting: decomposing divisors into prime divisors; computing pull-backs and push-forwards of divisors under finite mor...
متن کاملImaginary automorphisms on real hyperelliptic curves
A real hyperelliptic curve X is said to be Gaussian if there is an automorphism α : XC → XC such that α = [−1]C ◦ α, where [−1] denotes the hyperelliptic involution on X. Gaussian curves arise naturally in several contexts, for example when one studies real Jacobians. In the present paper we study the properties of Gaussian curves and we describe their moduli spaces. MSC 2000: 14H15, 14H37, 14P...
متن کاملZeta Function and Cryptographic Exponent of Supersingular Curves of Genus 2
We compute in a direct (not algorithmic) way the zeta function of all supersingular curves of genus 2 over a finite field k, with many geometric automorphisms. We display these computations in an appendix where we select a family of representatives of all these curves up to k-isomorphism and we exhibit equations and the zeta function of all their k/k-twists. As an application we obtain a direct...
متن کاملSpeeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
Pairings on the Jacobians of (hyper-)elliptic curves have received considerable attention not only as a tool to attack curve based cryptosystems but also as a building block for constructing cryptographic schemes with new and novel properties. Motivated by the work of Scott, we investigate how to use efficiently computable automorphisms to speed up pairing computations on two families of non-su...
متن کامل